QRT: A QR-Based Tridiagonalization Algorithm for Nonsymmetric Matrices
نویسندگان
چکیده
A QR-based tridiagonal-ization algorithm for nonsymmetric matrices. SIAM J. Mat.
منابع مشابه
A Note on the Accuracy of Symmetric Eigenreduction Algorithms
We present some experimental results illustrating the fact that on highly ill–conditioned Hermitian matrices the relative accuracy of computed small eigenvalues by QR eigenreduction may drastically depend on the initial permutation of the rows and columns. Mostly there was an “accurate” permutation, but there does not seem to be an easy method to get at it. For banded matrices, like those from ...
متن کاملCompression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
This paper is concerned with the reduction of a unitary matrix U to CMV-like shape. A Lanczos–type algorithm is presented which carries out the reduction by computing the block tridiagonal form of the Hermitian part of U , i.e., of the matrix U +UH . By elaborating on the Lanczos approach we also propose an alternative algorithm using elementary matrices which is numerically stable. If U is ran...
متن کاملTrading off Parallelism and Numerical Stability
[80] K. Veseli c. A quadratically convergent Jacobi-like method for real matrices with complex conjugate eigenvalues. [82] D. Watkins and L. Elsner. Convergence of algorithms of decomposition type for the eigenvalue problem. [83] Zhonggang Zeng. Homotopy-determinant algorithm for solving matrix eigenvalue problems and its parallelizations. [69] G. Shro. A parallel algorithm for the eigenvalues ...
متن کاملStochastic Modelling and Computation Importance Sampling Plays a Crucial Role for Quasi-monte Carlo Methods
8:30 – 8:50 Registration 8:50 – 9:00 Opening Remarks 9:00 – 9:30 Mike Hutchinson, Australian National University Locally adaptive gridding of elevation data 9:30 – 10:00 Malcolm Hudson, Macquarie University Block Fisher scoring optimization of penalized likelihoods in emission tomography 10:00 – 10:40 Alex Smola, NICTA Nonparametric tests for distributions 10:40 – 11:00 Morning Tea 11:00 – 11:4...
متن کاملA Wilkinson-like multishift QR algorithm for symmetric eigenvalue problems and its global convergence
In 1989, Bai and Demmel proposed the multishift QR algorithm for eigenvalue problems. Although the global convergence property of the algorithm (i.e., the convergence from any initial matrix) still remains an open question for general nonsymmetric matrices, in 1992 Jiang focused on symmetric tridiagonal case and gave a global convergence proof for the generalized Rayleigh quotient shifts. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 26 شماره
صفحات -
تاریخ انتشار 2005